A census of minimum pair-coverings with restricted largest block length
نویسندگان
چکیده
The quantity g (k) (v) was introduced in [6] as the minimum number of blocks necessary in a pairwise balanced design on v elements, subject to the condition that the longest block has length k. Recently, we have needed to use all possibilities for such minimal covering designs, and we record all non-isomorphic solutions to the problem for v ≤ 13.
منابع مشابه
Distance-spectrum formulas on the largest minimum distance of block codes
A general formula for the asymptotic largest minimum distance (in block length) of deterministic block codes under generalized distance functions (not necessarily additive, symmetric, and bounded) is presented. As revealed in the formula, the largest minimum distance can be fully determined by the ultimate statistical characteristics of the normalized distance function evaluated under a properl...
متن کاملMinimum Restricted Diameter Spanning Trees
Let G = (V,E) be a requirements graph. Let d = (dij)i,j=1 be a length metric. For a tree T denote by dT (i, j) the distance between i and j in T (the length according to d of the unique i − j path in T ). The restricted diameter of T , DT , is the maximum distance in T between pair of vertices with requirement between them. The minimum restricted diameter spanning tree problem is to find a span...
متن کاملCore partitions and block coverings
A number of new results about core partitions have been proved recently. ([2],[3], [9], [12]) For s ∈ N an s-core is by definition an integer partition without hooks of length s. This type of partitions first occurred in modular representation theory of symmetric groups, where s-cores label s-blocks of defect 0 in the case where s is a prime. In the study of relations between blocks for differe...
متن کاملGraph designs, packings and coverings of λKv with a graph of six vertices and containing a triangle
Let λKv be the complete multigraph with v vertices, where any two distinct vertices x and y are joined by λ edges (x, y). Let G be a finite simple graph. A G-design (G-packing, G-covering) of λKv, denoted by (v,G, λ)-GD ((v,G, λ)-PD, (v,G, λ)-CD), is a pair (X,B) where X is the vertex set of Kv and B is a collection of subgraphs of Kv, called blocks, such that each block is isomorphic to G and ...
متن کاملMaximal spanning time for neighborhood growth on the Hamming plane
We consider a long-range growth dynamics on the two-dimensional integer lattice, initialized by a finite set of occupied points. Subsequently, a site x becomes occupied if the pair consisting of the counts of occupied sites along the entire horizontal and vertical lines through x lies outside a fixed Young diagram Z. We study the extremal quantity μ(Z), the maximal finite time at which the latt...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Ars Comb.
دوره 52 شماره
صفحات -
تاریخ انتشار 1999